The recurrence function of a random Sturmian word
نویسندگان
چکیده
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length n of the Sturmian word. This parameter is central to combinatorics of words. Having fixed a possible length n for the factors, we let α to be drawn uniformly from the unit interval [0, 1], thus defining a random Sturmian word of slope α. Thus the waiting time for these factors becomes a random variable, for which we study the limit distribution and the limit density.
منابع مشابه
Recurrence Function on Sturmian Words: A Probabilistic Study
This paper is a first attempt to describe the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which provides precise information on the structure of such a word. With each Sturmian word of slope α, we associate particular sequences of factor lengths which have a given “position” with respect to the sequence of continuants of α...
متن کاملRelation between powers of factors and recurrence function characterizing Sturmian words
In this paper we put into relation the index of an infinite aperiodic word and its recurrence function. With the use of this relation, we then give a new characterization of Sturmian words. As a byproduct, we give a new proof of theorem of Damanik and Lenz describing the index of a Sturmian word in terms of the continued fraction expansion of its slope.
متن کاملRelation between powers of factors and the recurrence function characterizing Sturmian words
In this paper we put into relation the index of an infinite aperiodic word and its recurrence function. With the use of this relation, we then give a new characterization of Sturmian words. As a byproduct, we give a new proof of theorem of Damanik and Lenz describing the index of a Sturmian word in terms of the continued fraction expansion of its slope.
متن کاملRandom generation of finite Sturmian words
We present a bijection between the set of factors of given length of Sturmian words and some set of triples of nonnegative integers. This bijection and its inverse are both computable in linear time. Its applications are: a bijective proof of Mignosi's formula for counting Sturmian words, a linear probabilistic algorithm for generating finite Sturmian word at random, and, using similar techniqu...
متن کاملOccurrence and Lexicographic Properties of Standard Sturmian Words
Standard Sturmian words form an interesting class of structurally highly compressible strings. represented by simple recurrences. We show that simplicity of representation implies new algorithmic results: the compressed string matching for such words can be solved by very special algorithms and the output is simply characterized. Each standard Sturmian word w has Occurrence Shift Property: the ...
متن کامل